Constructions of Self-complementary Circulants with No Multiplicative Isomorphisms
نویسندگان
چکیده
The main topic of the paper is the question of the existence of self-complementary Cayley graphs Cay(G; S) with the property S 6 = G # n S for all 2 Aut(G). We answer this question in the positive by constructing an innnite family of self-complementary circulants with this property. Moreover, we obtain a complete classiication of primes p for which there exist self-complementary circulants of order p 2 with this property.
منابع مشابه
Some Identities for Enumerators of Circulant Graphs
We establish analytically several new identities connecting enumerators of different types of circulant graphs mainly of prime, twice prime and prime-squared orders. In particular, it is shown that the half-sum of the number of undirected circulants and the number of undirected self-complementary circulants of prime order is equal to the number of directed self-complementary circulants of the s...
متن کاملSelf-Complementary Vertex-Transitive Graphs
A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...
متن کاملA Linear Logical View of Linear Type Isomorphisms
The notion of isomorphisms of types has many theoretical as well as practical consequences, and isomorphisms of types have been investigated at length over the past years. Isomorphisms in weak system (like linear lambda calculus) have recently been investigated due to their practical interest in library search. In this paper we give a remarkably simple and elegant characterization of linear iso...
متن کاملLow-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes
This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in const...
متن کاملTropical Constructions and Lifts
1 The Algebraic Torus and M Let K denote a field of characteristic zero and K∗ denote the associated multiplicative group. A character on (K∗)n is a monomial in the associated Laurent polynomial ring with coefficient 1. For example, (K∗)2 has coordinate ring K[x±1, y±1] and characters on (K∗)2 are of the form xy for i, j ∈ Z. (K∗)n is called the algebraic n-torus. First we must describe functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2001